A Hybrid Greedy Routing with Location Information for Mobile Ad Hoc Networks

Recently, in mobile ad hoc networks, routing schemes using location information have been proposed. Most of these schemes assume that the source node already knows the location information of the destination node. However, since all nodes are always moving, it is difficult to apply this assumption to the real mobile ad hoc environment. In order to cope this difficulty, this paper presents a new routing scheme HGR (a Hybrid Greedy Routing with location and velocity information), which considers the location and velocity information of the destination node and the neighboring nodes. In HGR, when a source node creates a route to a destination node, the future location of neighboring nodes and the destination node predicted by the source node is calculated using these location and velocity information. And the source node sends data packets to the neighboring node that is the closest to the destination node based on these predicted location and velocity information. This paper shows that HGR achieves high data delivery ratio and fewer overheads for the route creation and maintenance through simulation experiments. key words: ad hoc networks, geographical routing